On polynomials with least weighted maximum

Least-Squares Fitting of Data with Polynomials

On Weighted Structured Total Least Squares

In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complexity of the proposed algorithm is preserved linear in the sample size when the weight matrix is banded with bandwidth that is independent of the sample size.

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

Weighted Least Squares Estimation with Missing Data

Jacobi-weighted Orthogonal Polynomials on Triangular Domains

We construct Jacobi-weighted orthogonal polynomials (α,β,γ) n,r (u,v,w), α,β,γ > −1, α+ β + γ = 0, on the triangular domain T . We show that these polynomials (α,β,γ) n,r (u, v,w) over the triangular domain T satisfy the following properties: (α,β,γ) n,r (u,v,w) ∈ n, n≥ 1, r = 0,1, . . . ,n, and (α,β,γ) n,r (u,v,w) ⊥ (α,β,γ) n,s (u,v,w) for r =s. Hence, (α,β,γ) n,r (u,v,w), n= 0,1,2, . . ., r =...